Tight bounds for parameterized complexity of Cluster Editing with a small number of clusters
نویسندگان
چکیده
منابع مشابه
Tight bounds for Parameterized Complexity of Cluster Editing
In the Correlation Clustering problem, also known as Cluster Editing, we are given an undirected graph G and a positive integer k; the task is to decide whether G can be transformed into a cluster graph, i.e., a disjoint union of cliques, by changing at most k adjacencies, that is, by adding or deleting at most k edges. The motivation of the problem stems from various tasks in computational bio...
متن کاملOn the complexity of multi-parameterized cluster editing
The Cluster Editing problem seeks a transformation of a given undirected graph into a disjoint union of cliques via a minimum number of edge additions or deletions. A multi-parameterized version of the problem is studied, featuring a number of input parameters that bound the amount of both edge-additions and deletions per single vertex, as well as the size of a clique-cluster. We show that the ...
متن کاملEfficient Parameterized Preprocessing for Cluster Editing
In the Cluster Editing problem, a graph is to be changed to a disjoint union of cliques by at most k operations of edge insertion or edge deletion. Improving on the best previously known quadratic-size polynomial-time kernelization, we describe how a crown-type structural reduction rule can be used to obtain a 6k kernelization bound.
متن کاملGoing Weighted: Parameterized Algorithms for Cluster Editing
The goal of the Cluster Editing problem is to make the fewest changes to the edge set of an input graph such that the resulting graph is a disjoint union of cliques. This problem is NP-complete but recently, several parameterized algorithms have been proposed. In this paper we present a surprisingly simple branching strategy for Cluster Editing. We generalize the problem assuming that edge inse...
متن کاملKernelization and Parameterized Complexity of Star Editing and Union Editing
The NP-hard Star Editing problem has as input a graph G = (V, E) with edges colored red and black and two positive integers k1 and k2, and determines whether one can recolor at most k1 black edges to red and at most k2 red edges to black, such that the resulting graph has an induced subgraph whose edge set is exactly the set of black edges. A generalization of Star Editing is Union Editing, whi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computer and System Sciences
سال: 2014
ISSN: 0022-0000
DOI: 10.1016/j.jcss.2014.04.015